Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)

نویسندگان

  • Julien Allali
  • Cédric Chauve
  • Laetitia Bourgeade
چکیده

Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming algorithm that combines the advantages of both algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps

Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In practice, using local alignments as fragments, instead of Maximal Exact Matches (MEMs), generates frequent overlaps between fragments, due to combinatorial reasons and biological factors, i.e., variable tandem repeat stru...

متن کامل

Decomposition and Analysis of Driving Forces of GHG Emissions and Emission Reduction Potentials in Iran

Climate change cannot control unless by reduction of GHG emissions to secure level, therefore it is important to identify driving forces and possible scenarios based on targets. In this research, the Logarithmic Mean Divisia Index decomposition approach in combination with Extended Kaya Identity (EKI) are applied to investigate five factors could affect emissions during 1971-2012 in Iran. Thes...

متن کامل

A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is defined as the sum of weights of the fragments it consists of. and the optimization problem is to fi...

متن کامل

Type-2 Fuzzy Hybrid Expert System For Diagnosis Of Degenerative Disc Diseases

One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...

متن کامل

Chaining Multiple - Alignment Fragments in Sub - Quadratic

We describe a multiple-sequence alignment algorithm for determining the highest-scoring alignment that can be obtained by chaining together non-overlapping subalignments selected from a given collection of such \fragments". For a given set of K sequences, a problem instance consists of a set of F precomputed fragments, an alignment score for each fragment, and a \gap" penalty function that assi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015